267 research outputs found
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
For both the edge deletion heuristic and the maximum-degree greedy heuristic,
we study the problem of recognizing those graphs for which that heuristic can
approximate the size of a minimum vertex cover within a constant factor of r,
where r is a fixed rational number. Our main results are that these problems
are complete for the class of problems solvable via parallel access to NP. To
achieve these main results, we also show that the restriction of the vertex
cover problem to those graphs for which either of these heuristics can find an
optimal solution remains NP-hard.Comment: 16 pages, 2 figure
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial
In this tutorial, selected topics of cryptology and of computational
complexity theory are presented. We give a brief overview of the history and
the foundations of classical cryptography, and then move on to modern
public-key cryptography. Particular attention is paid to cryptographic
protocols and the problem of constructing the key components of such protocols
such as one-way functions. A function is one-way if it is easy to compute, but
hard to invert. We discuss the notion of one-way functions both in a
cryptographic and in a complexity-theoretic setting. We also consider
interactive proof systems and present some interesting zero-knowledge
protocols. In a zero-knowledge protocol one party can convince the other party
of knowing some secret information without disclosing any bit of this
information. Motivated by these protocols, we survey some complexity-theoretic
results on interactive proof systems and related complexity classes.Comment: 57 pages, 17 figures, Lecture Notes for the 11th Jyvaskyla Summer
Schoo
Complexity of Manipulation, Bribery, and Campaign Management in Bucklin and Fallback Voting
A central theme in computational social choice is to study the extent to
which voting systems computationally resist manipulative attacks seeking to
influence the outcome of elections, such as manipulation (i.e., strategic
voting), control, and bribery. Bucklin and fallback voting are among the voting
systems with the broadest resistance (i.e., NP-hardness) to control attacks.
However, only little is known about their behavior regarding manipulation and
bribery attacks. We comprehensively investigate the computational resistance of
Bucklin and fallback voting for many of the common manipulation and bribery
scenarios; we also complement our discussion by considering several campaign
management problems for Bucklin and fallback.Comment: 28 page
- …